KILLED
Runtime Complexity (full) proof of /tmp/tmp8OJ72R/LengthOfFiniteLists_nokinds_noand_C.xml
The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).
0 CpxTRS
↳1 DecreasingLoopProof (⇔, 7204 ms)
↳2 BOUNDS(n^1, INF)
↳3 RenamingProof (⇔, 5 ms)
↳4 CpxRelTRS
↳5 TypeInferenceProof (BOTH BOUNDS(ID, ID), 0 ms)
↳6 typed CpxTrs
↳7 OrderProof (LOWER BOUND(ID), 0 ms)
↳8 typed CpxTrs
↳9 NoRewriteLemmaProof (LOWER BOUND(ID), 78 ms)
↳10 typed CpxTrs
↳11 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳12 typed CpxTrs
↳13 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳14 typed CpxTrs
↳15 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳16 typed CpxTrs
↳17 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳18 typed CpxTrs
↳19 NoRewriteLemmaProof (LOWER BOUND(ID), 21 ms)
↳20 typed CpxTrs
↳21 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳22 typed CpxTrs
↳23 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳24 typed CpxTrs
↳25 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳26 typed CpxTrs
↳27 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳28 typed CpxTrs
↳29 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳30 typed CpxTrs
↳31 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳32 typed CpxTrs
↳33 NoRewriteLemmaProof (LOWER BOUND(ID), 14 ms)
↳34 typed CpxTrs
↳35 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳36 typed CpxTrs
↳37 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
↳38 typed CpxTrs
(0) Obligation:
Runtime Complexity TRS:
The TRS R consists of the following rules:
active(zeros) → mark(cons(0, zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0)) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0)
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Rewrite Strategy: FULL
(1) DecreasingLoopProof (EQUIVALENT transformation)
The following loop(s) give(s) rise to the lower bound Ω(n1):
The rewrite sequence
cons(mark(X1), X2) →+ mark(cons(X1, X2))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [X1 / mark(X1)].
The result substitution is [ ].
(2) BOUNDS(n^1, INF)
(3) RenamingProof (EQUIVALENT transformation)
Renamed function symbols to avoid clashes with predefined symbol.
(4) Obligation:
Runtime Complexity Relative TRS:
The TRS R consists of the following rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
S is empty.
Rewrite Strategy: FULL
(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)
Infered types.
(6) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
(7) OrderProof (LOWER BOUND(ID) transformation)
Heuristically decided to analyse the following defined symbols:
active, cons, U42, isNatIList, U52, isNatList, U62, isNat, s, length, U11, U21, U31, U41, U51, U61, proper, topThey will be analysed ascendingly in the following order:
cons < active
U42 < active
isNatIList < active
U52 < active
isNatList < active
U62 < active
isNat < active
s < active
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
cons < proper
U42 < proper
isNatIList < proper
U52 < proper
isNatList < proper
U62 < proper
isNat < proper
s < proper
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(8) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
cons, active, U42, isNatIList, U52, isNatList, U62, isNat, s, length, U11, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
cons < active
U42 < active
isNatIList < active
U52 < active
isNatList < active
U62 < active
isNat < active
s < active
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
cons < proper
U42 < proper
isNatIList < proper
U52 < proper
isNatList < proper
U62 < proper
isNat < proper
s < proper
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol cons.
(10) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
U42, active, isNatIList, U52, isNatList, U62, isNat, s, length, U11, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
U42 < active
isNatIList < active
U52 < active
isNatList < active
U62 < active
isNat < active
s < active
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
U42 < proper
isNatIList < proper
U52 < proper
isNatList < proper
U62 < proper
isNat < proper
s < proper
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(11) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol U42.
(12) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
isNatIList, active, U52, isNatList, U62, isNat, s, length, U11, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
isNatIList < active
U52 < active
isNatList < active
U62 < active
isNat < active
s < active
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
isNatIList < proper
U52 < proper
isNatList < proper
U62 < proper
isNat < proper
s < proper
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol isNatIList.
(14) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
U52, active, isNatList, U62, isNat, s, length, U11, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
U52 < active
isNatList < active
U62 < active
isNat < active
s < active
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
U52 < proper
isNatList < proper
U62 < proper
isNat < proper
s < proper
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol U52.
(16) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
isNatList, active, U62, isNat, s, length, U11, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
isNatList < active
U62 < active
isNat < active
s < active
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
isNatList < proper
U62 < proper
isNat < proper
s < proper
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(17) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol isNatList.
(18) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
U62, active, isNat, s, length, U11, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
U62 < active
isNat < active
s < active
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
U62 < proper
isNat < proper
s < proper
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(19) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol U62.
(20) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
isNat, active, s, length, U11, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
isNat < active
s < active
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
isNat < proper
s < proper
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(21) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol isNat.
(22) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
s, active, length, U11, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
s < active
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
s < proper
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(23) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol s.
(24) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
length, active, U11, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
length < active
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
length < proper
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(25) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol length.
(26) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
U11, active, U21, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
U11 < active
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
U11 < proper
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(27) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol U11.
(28) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
U21, active, U31, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
U21 < active
U31 < active
U41 < active
U51 < active
U61 < active
active < top
U21 < proper
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(29) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol U21.
(30) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
U31, active, U41, U51, U61, proper, top
They will be analysed ascendingly in the following order:
U31 < active
U41 < active
U51 < active
U61 < active
active < top
U31 < proper
U41 < proper
U51 < proper
U61 < proper
proper < top
(31) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol U31.
(32) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
U41, active, U51, U61, proper, top
They will be analysed ascendingly in the following order:
U41 < active
U51 < active
U61 < active
active < top
U41 < proper
U51 < proper
U61 < proper
proper < top
(33) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol U41.
(34) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
U51, active, U61, proper, top
They will be analysed ascendingly in the following order:
U51 < active
U61 < active
active < top
U51 < proper
U61 < proper
proper < top
(35) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol U51.
(36) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
U61, active, proper, top
They will be analysed ascendingly in the following order:
U61 < active
active < top
U61 < proper
proper < top
(37) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)
Could not prove a rewrite lemma for the defined symbol U61.
(38) Obligation:
TRS:
Rules:
active(zeros) → mark(cons(0', zeros))
active(U11(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt)) → mark(tt)
active(U41(tt, V2)) → mark(U42(isNatIList(V2)))
active(U42(tt)) → mark(tt)
active(U51(tt, V2)) → mark(U52(isNatList(V2)))
active(U52(tt)) → mark(tt)
active(U61(tt, L, N)) → mark(U62(isNat(N), L))
active(U62(tt, L)) → mark(s(length(L)))
active(isNat(0')) → mark(tt)
active(isNat(length(V1))) → mark(U11(isNatList(V1)))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(isNatIList(V)) → mark(U31(isNatList(V)))
active(isNatIList(zeros)) → mark(tt)
active(isNatIList(cons(V1, V2))) → mark(U41(isNat(V1), V2))
active(isNatList(nil)) → mark(tt)
active(isNatList(cons(V1, V2))) → mark(U51(isNat(V1), V2))
active(length(nil)) → mark(0')
active(length(cons(N, L))) → mark(U61(isNatList(L), L, N))
active(cons(X1, X2)) → cons(active(X1), X2)
active(U11(X)) → U11(active(X))
active(U21(X)) → U21(active(X))
active(U31(X)) → U31(active(X))
active(U41(X1, X2)) → U41(active(X1), X2)
active(U42(X)) → U42(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X)) → U52(active(X))
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2)) → U62(active(X1), X2)
active(s(X)) → s(active(X))
active(length(X)) → length(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
U11(mark(X)) → mark(U11(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2) → mark(U41(X1, X2))
U42(mark(X)) → mark(U42(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X)) → mark(U52(X))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2) → mark(U62(X1, X2))
s(mark(X)) → mark(s(X))
length(mark(X)) → mark(length(X))
proper(zeros) → ok(zeros)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0') → ok(0')
proper(U11(X)) → U11(proper(X))
proper(tt) → ok(tt)
proper(U21(X)) → U21(proper(X))
proper(U31(X)) → U31(proper(X))
proper(U41(X1, X2)) → U41(proper(X1), proper(X2))
proper(U42(X)) → U42(proper(X))
proper(isNatIList(X)) → isNatIList(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X)) → U52(proper(X))
proper(isNatList(X)) → isNatList(proper(X))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2)) → U62(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(s(X)) → s(proper(X))
proper(length(X)) → length(proper(X))
proper(nil) → ok(nil)
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
U11(ok(X)) → ok(U11(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2)) → ok(U41(X1, X2))
U42(ok(X)) → ok(U42(X))
isNatIList(ok(X)) → ok(isNatIList(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X)) → ok(U52(X))
isNatList(ok(X)) → ok(isNatList(X))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2)) → ok(U62(X1, X2))
isNat(ok(X)) → ok(isNat(X))
s(ok(X)) → ok(s(X))
length(ok(X)) → ok(length(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))
Types:
active :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
zeros :: zeros:0':mark:tt:nil:ok
mark :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
cons :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
0' :: zeros:0':mark:tt:nil:ok
U11 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
tt :: zeros:0':mark:tt:nil:ok
U21 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U31 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U41 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U42 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatIList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U51 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U52 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNatList :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U61 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
U62 :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
isNat :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
s :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
length :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
nil :: zeros:0':mark:tt:nil:ok
proper :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
ok :: zeros:0':mark:tt:nil:ok → zeros:0':mark:tt:nil:ok
top :: zeros:0':mark:tt:nil:ok → top
hole_zeros:0':mark:tt:nil:ok1_0 :: zeros:0':mark:tt:nil:ok
hole_top2_0 :: top
gen_zeros:0':mark:tt:nil:ok3_0 :: Nat → zeros:0':mark:tt:nil:ok
Generator Equations:
gen_zeros:0':mark:tt:nil:ok3_0(0) ⇔ zeros
gen_zeros:0':mark:tt:nil:ok3_0(+(x, 1)) ⇔ mark(gen_zeros:0':mark:tt:nil:ok3_0(x))
The following defined symbols remain to be analysed:
active, proper, top
They will be analysed ascendingly in the following order:
active < top
proper < top